Maximizing the expected range from dependent observations under mean–variance information
نویسندگان
چکیده
منابع مشابه
Expected power-utility maximization under incomplete information and with Cox-process observations
We consider the problem of maximization of expected terminal power utility (risk sensitive criterion). The underlying market model is a regime-switching diffusion model where the regime is determined by an unobservable factor process forming a finite state Markov process. The main novelty is due to the fact that prices are observed and the portfolio is rebalanced only at random times correspond...
متن کاملExpected log-utility maximization under incomplete information and with Cox-process observations
We consider the portfolio optimization problem for the criterion of maximization of expected terminal log-utility. The underlying market model is a regime-switching diffusion model where the regime is determined by an unobservable factor process forming a finite state Markov process. The main novelty is due to the fact that prices are observed and the portfolio is rebalanced only at random time...
متن کاملOptimal Portfolio Policies under Bounded Expected Loss and Partial Information Optimal Portfolio Policies under Bounded Expected Loss and Partial Information *
In a market with partial information we consider the optimal selection of portfolios for utility maximizing investors under joint budget and shortfall risk constraints. The shortfall risk is measured in terms of expected loss. Stock returns satisfy a stochastic differential equation. Under general conditions on the corresponding drift process we provide the optimal trading strategy using Mallia...
متن کاملMaximizing expected utility over a knapsack constraint
The expected utility knapsack problem is to pick a set of items whose values are described by random variables so as to maximize the expected utility of the total value of the items picked while satisfying a constraint on the total weight of items picked. We consider the following solution approach for this problem: (i) use the sample average approximation framework to approximate the stochasti...
متن کاملMaximizing Aggregate Throughput in Information Networks Under Byzantine Attacks
We present polynomial time algorithms that maximize the aggregate throughput in single-source multicast networks that employ random network coding and are subject to Byzantine attacks. Our results are applicable to wireline and wireless networks, assume no restrictions on size of min-cut from the source to the receivers and are provably optimal.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistics
سال: 2015
ISSN: 0233-1888,1029-4910
DOI: 10.1080/02331888.2015.1074234